Solving Mixed-Integer Nonlinear Programs by QP-Diving
نویسندگان
چکیده
We present a new tree-search algorithm for solving mixed-integer nonlinear programs (MINLPs). Rather than relying on computationally expensive nonlinear solves at every node of the branchand-bound tree, our algorithm solves a quadratic approximation at every node. We show that the resulting algorithm retains global convergence properties for convex MINLPs, and we present numerical results on a range of test problems. Our numerical experience shows that the new algorithm allows us to exploit warm-starting techniques from quadratic programming, resulting in a reduction in solve times for convex MINLPs by orders of magnitude on some classes of problems.
منابع مشابه
A Logic-Based Hybrid Solver for Optimal Control of Hybrid Systems
Combinatorial optimization over continuous and integer variables was proposed recently as an useful tool for solving complex optimal control problems for linear hybrid dynamical systems formulated in discretetime. Current approaches are based on mixed-integer linear/quadratic programming (MIP), which provides the solution after solving a sequence of relaxed standard linear (or quadratic) progra...
متن کاملAlgorithms and Software for Convex Mixed Integer Nonlinear Programs
This paper provides a survey of recent progress and software for solving convex mixed integer nonlinear programs (MINLP)s, where the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MINLPs have received sustained attention in recent years. By exploiting analogies to well-known techniques for solving ...
متن کاملSolving Mixed-Integer Quadratic Programs Via Nonnegative Least Squares
Abstract: This paper proposes a new algorithm for solving Mixed-Integer Quadratic Programming (MIQP) problems. The algorithm is particularly tailored to solving small-scale MIQPs such as those that arise in embedded hybrid Model Predictive Control (MPC) applications. The approach combines branch and bound (B&B) with nonnegative least squares (NNLS), that are used to solve Quadratic Programming ...
متن کاملA Feasibility Pump for mixed integer nonlinear programs
Abstract We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within an outer approximation scheme. We r...
متن کاملSolving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm
In this article we look at a new algorithm for solving convex mixed integer nonlinear programming problems. The algorithm uses an integrated approach, where a branch and bound strategy is mixed with solving nonlinear programming problems at each node of the tree. The nonlinear programming problems, at each node, are not solved to optimality, rather one iteration step is taken at each node and t...
متن کامل